By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 38, Issue 1, pp. 1-447

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model

Nir Halman

pp. 1-45

Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments

Sophie Laplante and Frédéric Magniez

pp. 46-62

Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table

Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, and Michael Saks

pp. 63-84

Uniform Hashing in Constant Time and Optimal Space

Anna Pagh and Rasmus Pagh

pp. 85-96

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, and Adam Smith

pp. 97-139

Sub-Constant Error Low Degree Test of Almost-Linear Size

Dana Moshkovitz and Ran Raz

pp. 140-180

On Approximating Restricted Cycle Covers

Bodo Manthey

pp. 181-206

Testing Graph Isomorphism

Eldar Fischer and Arie Matsliah

pp. 207-225

Improving the Stretch Factor of a Geometric Network by Edge Augmentation

Mohammad Farshi, Panos Giannopoulos, and Joachim Gudmundsson

pp. 226-240

Equitable Cost Allocations via Primal–Dual-Type Algorithms

Kamal Jain and Vijay V. Vazirani

pp. 241-256

Vertical Ray Shooting and Computing Depth Orders for Fat Objects

Mark de Berg and Chris Gray

pp. 257-275

Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements

Reuven Cohen and David Peleg

pp. 276-302

Plottable Real Number Functions and the Computable Graph Theorem

Vasco Brattka

pp. 303-328

MAX ONES Generalized to Larger Domains

Peter Jonsson, Fredrik Kuivinen, and Gustav Nordh

pp. 329-365

Exponential Separation of Quantum and Classical One-Way Communication Complexity

Ziv Bar-Yossef, T. S. Jayram, and Iordanis Kerenidis

pp. 366-384

The Euclidean Orienteering Problem Revisited

Ke Chen and Sariel Har-Peled

pp. 385-397

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

János Balogh, József Békési, Gábor Galambos, and Gerhard Reinelt

pp. 398-410

An APTAS for Generalized Cost Variable-Sized Bin Packing

Leah Epstein and Asaf Levin

pp. 411-428

Binary Space Partitions for Axis-Aligned Fat Rectangles

Csaba D. Tóth

pp. 429-447